public class Solution3 {
    //746. 使用最小花费爬楼梯
    public int minCostClimbingStairs(int[] cost) {
        //dp[i] 爬到第i阶台阶的最小花费
        //dp[i] = Math.min(dp[i-1]+cost[i-1],dp[i-2]+cost[i-2]);
        int n = cost.length;
        int[] dp = new int[n+1];
        dp[0] = 0;dp[1] = 0;
        for (int i = 2; i <= n; i++) {
            dp[i] = Math.min(dp[i-1]+cost[i-1],dp[i-2]+cost[i-2]);
        }
        return dp[n];
    }
}
